Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
نویسندگان
چکیده
منابع مشابه
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Goncharov and Peretyat’kin independently gave necessary and sufficient conditions for when a set of types of a complete theory T is the type spectrum of some homogeneous model of T . Their result can be stated as a principle of second order arithmetic, which we call the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previou...
متن کاملBounding homogeneous models
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram D(A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if...
متن کاملCombinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (ChainAntiChai...
متن کاملWKL0 and induction principles in model theory
We examine the reverse mathematics of aspects of basic classical and effective model theory, including: existence of homogeneous and saturated models, different type-amalgamation properties, the preorder of models under elementary embeddability, and existence of indiscernibles. Most theorems are equivalent to RCA0, WKL0, or ACA0. Some, however, exhibit peculiar strengths such as ¬WKL0 ∨ ACA0 an...
متن کاملΣn-BOUNDING AND ∆n-INDUCTION
Working in the base theory of PA−+ IΣ0 + exp, we show that for all n ∈ ω, the bounding principle for Σn-formulas (BΣn) is equivalent to the induction principle for ∆n-formulas (I∆n). This partially answers a question of J. Paris.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the American Mathematical Society
سال: 2017
ISSN: 0065-9266,1947-6221
DOI: 10.1090/memo/1187